Colored Homomorphisms of Colored Mixed Graphs
نویسندگان
چکیده
منابع مشابه
Colored Homomorphisms of Colored Mixed Graphs
The homomorphisms of oriented or undirected graphs, the oriented chromatic number, the relationship between acyclic coloring number and oriented chromatic number, have been recently studied. Improving and combining earlier techniques of N. Alon and T. H. Marshall (1998, J. Algebraic Combin. 8, 5 13) and A. Raspaud and E. Sopena (1994, Inform. Process. Lett. 51, 171 174) we prove here a general ...
متن کاملHomomorphisms of 2-edge-colored graphs
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2-trees, partial 3-trees, planar graphs) and the problem is to find, for each class, the smallest number of vertices of a 2-edge-colored graph H such that each graph of the considered class admits a homomorphism to H.
متن کاملOn Chromatic Number of Colored Mixed Graphs
An (m,n)-colored mixed graph G is a graph with its arcs having one of the m different colors and edges having one of the n different colors. A homomorphism f of an (m,n)colored mixed graph G to an (m,n)-colored mixed graph H is a vertex mapping such that if uv is an arc (edge) of color c in G, then f(u)f(v) is an arc (edge) of color c in H . The (m,n)-colored mixed chromatic number χ(m,n)(G) of...
متن کاملHomomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs
In this article, we introduce and study the properties of some target graphs for 2-edge-colored homomorphism. Using these properties, we obtain in particular that the 2-edge-colored chromatic number of the class of triangle-free planar graphs is at most 50. We also show that it is at least 12. C © 2016 Wiley Periodicals, Inc. J. Graph Theory 00: 1–20, 2016
متن کاملHomomorphisms of Edge-Colored Graphs and Coxeter Groups
Let G1 = (V1, E1) and G2 = (V2, E2) be two edge-colored graphs (without multiple edges or loops). A homomorphism is a mapping φ : V1 7→ V2 for which, for every pair of adjacent vertices u and v of G1, φ(u) and φ(v) are adjacent in G2 and the color of the edge φ(u)φ(v) is the same as that of the edge uv. We prove a number of results asserting the existence of a graph G, edge-colored from a set C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2000
ISSN: 0095-8956
DOI: 10.1006/jctb.2000.1977